Upper Semilattice of Binary Strings with the Relation "x is Simple Conditional to y"
نویسندگان
چکیده
We study the properties of the set of binary strings with the relation \the Kolmogorov complexity of x conditional to y is small". We prove that there are pairs of strings which have no greatest common lower bound with respect to this pre-order. We present several examples when the greatest common lower bound exists but its complexity is much less than mutual information (extending G acs and K orner result [2]).
منابع مشابه
Distributive Lattices of λ-simple Semirings
In this paper, we study the decomposition of semirings with a semilattice additive reduct. For, we introduce the notion of principal left $k$-radicals $Lambda(a)={x in S | a stackrel{l}{longrightarrow^{infty}} x}$ induced by the transitive closure $stackrel{l}{longrightarrow^{infty}}$ of the relation $stackrel{l}{longrightarrow}$ which induce the equivalence relation $lambda$. Again non-transit...
متن کامل8 A Relation between Complexity and
We derive two asymptotic formulas relating the Kolmogorov complexity of strings over a nite alphabet to the entropy of a discrete Markov information source that generates the strings. In 2], Beyer, Stein, and Ulam discussed several notions of complexity of integers and made a conjecture relating Kolmogorov complexity and information theoretic entropy. We will state this conjecture, after summar...
متن کاملWeak Relative Pseudocomplements in Semilattices
Weak relative pseudocomplementation on a meet semilattice S is a partial operation ∗ which associates with every pair (x, y) of elements, where x ≥ y, an element z (the weak pseudocomplement of x relative to y) which is the greatest among elements u such that y = u ∧ x. The element z coincides with the pseudocomplement of x in the upper section [y) and, if S is modular, with the pseudocomplemen...
متن کاملJānis C̄ırulis WEAK RELATIVE PSEUDOCOMPLEMENTS IN SEMILATTICES
Weak relative pseudocomplementation on a meet semilattice S is a partial operation ∗ which associates with every pair (x, y) of elements, where x ≥ y, an element z (the weak pseudocomplement of x relative to y) which is the greatest among elements u such that y = u ∧ x. The element z coincides with the pseudocomplement of x in the upper section [y) and, if S is modular, with the pseudocomplemen...
متن کاملModular and Distributive Semilattices
A modular semilattice is a semilattice S in which w > a A ft implies that there exist i,jeS such that x > a. y > b and x A y = x A w. This is equivalent to modularity in a lattice and in the semilattice of ideals of the semilattice, and the condition implies the Kurosh-Ore replacement property for irreducible elements in a semilattice. The main results provide extensions of the classical charac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 271 شماره
صفحات -
تاریخ انتشار 1999